Additive preservers of non-zero decomposable tensors
نویسندگان
چکیده
منابع مشابه
Zero Product Preservers of C*-algebras
Let θ : A → B be a zero-product preserving bounded linear map between C*-algebras. Here neither A nor B is necessarily unital. In this note, we investigate when θ gives rise to a Jordan homomorphism. In particular, we show that A and B are isomorphic as Jordan algebras if θ is bijective and sends zero products of self-adjoint elements to zero products. They are isomorphic as C*-algebras if θ is...
متن کاملBetter Distance Preservers and Additive Spanners
Wemake improvements to the current upper bounds on pairwise distance preservers and additive spanners. A distance preserver is a sparse subgraph that exactly preserves all distances in a given pair set P . We show that every undirected unweighted graph has a distance preserver on O(max{n|P |, n|P |}) edges, and we conjecture that O(n|P |+ n) is possible. An additive subset spanner is a sparse s...
متن کاملSuccessive Rank-One Approximations of Nearly Orthogonally Decomposable Symmetric Tensors
Many idealized problems in signal processing, machine learning and statistics can be reduced to the problem of finding the symmetric canonical decomposition of an underlying symmetric and orthogonally decomposable (SOD) tensor. Drawing inspiration from the matrix case, the successive rank-one approximations (SROA) scheme has been proposed and shown to yield this tensor decomposition exactly, an...
متن کاملOn the Structure Groups of Decomposable Algebraic Curvature Tensors
This paper examines the action of GLN (R) on decomposable algebraic curvature tensors. The main result is that the structure group of a decomposable algebraic curvature tensor can only permute the subspaces into which the tensor decomposes: if the tensor decomposes into tensors Ri on Vi where V = ⊕k i=1 Vi, then for any matrix A in the structure group there exists a permutation σ such that A : ...
متن کاملSuccessive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors
Many idealized problems in signal processing, machine learning and statistics can be reduced to the problem of finding the symmetric canonical decomposition of an underlying symmetric and orthogonally decomposable (SOD) tensor. Drawing inspiration from the matrix case, the successive rank-one approximations (SROA) scheme has been proposed and shown to yield this tensor decomposition exactly, an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2008
ISSN: 0024-3795
DOI: 10.1016/j.laa.2007.09.011